Mapping Tasks to Processors at Run-time
نویسنده
چکیده
We consider the dynamic task allocation problem in multicomputer system with multiprogramming. Programs are given as task interaction graphs that have to be mapped onto the processors at run-time. We propose a fast two-phase heuristic algorithm where phase 1 performs a hierarchic clustering of the tasks which is used by the second phase to map clusters of suitable size onto free partitions of the processor graph.
منابع مشابه
Run-time Assignment of Tasks to Multiple Heterogeneous Processors
This paper describes the implementation and evaluation of an algorithm that maps a number of communicating processes to a heterogeneous tiled System on Chip (SoC) architecture at run-time. The mapping algorithm minimizes the total amount of energy consumption, while still providing an adequate Quality of Service (QoS). The properties of the algorithm are described and evaluated and a realistic ...
متن کاملBenefits of Topology Aware Mapping for Mesh Interconnects
The fastest supercomputers today such as Blue Gene/L, Blue Gene/P, Cray XT3 and XT4 are connected by a three-dimensional torus/mesh interconnect. Applications running on these machines can benefit from topology-awareness while mapping tasks to processors at runtime. By co-locating communicating tasks on nearby processors, the distance traveled by messages and hence the communication traffic can...
متن کاملOptimal Latency{Throughput Tradeo s for Data Parallel Pipelines
This paper addresses optimal mapping of parallel programs composed of a chain of data parallel tasks onto the processors of a parallel system. The input to this class of programs is a stream of data sets, each of which is processed in order by the chain of tasks. This computation structure, also referred to as a data parallel pipeline, is common in several application domains including digital ...
متن کاملHeuristic and neural algorithms for mapping tasks to a reconfigurable array
We consider the problem of mapping tasks onto processors in a reconfigurable array architecture. We assume a directed acyclic task graph as input. The node weights in the task graph represent their computational requirement; the weight on an edge (i, j> is an estimate of the communication requirement between tasks i and j. The problem is to (a) estimate the minimum number of processors p to exe...
متن کاملEvaluation of Mapping and Dynamic Load-Balancing Strategies in SEPP-HPCTI
A fundamental issue affecting the performance of a parallel application running on message-passing parallel systems is the assignment of tasks to processors in order to get the minimum completion time. In SEPP and HPCTI, tools for static and dynamic task assignment are considered complementary: static mapping tools compute and initial assignment of tasks on processors while dynamic load balanci...
متن کامل